Improved Learning-Automata-Based Clustering Method for Controlled Placement Problem in SDN

نویسندگان

چکیده

Clustering, an unsupervised machine learning technique, plays a crucial role in partitioning unlabeled data into meaningful groups. K-means, known for its simplicity, has gained popularity as clustering method. However, both K-means and the LAC algorithm, which utilize automata, are sensitive to selection of initial points. To overcome this limitation, we propose enhanced algorithm based on K-Harmonic means approach. We evaluate performance seven datasets demonstrate superiority over other representative algorithms. Moreover, tailor address controller placement problem software-defined networks, critical field context. optimize relevant parameters such switch–controller delay, intercontroller load balancing, leverage automata. In our comparative analysis conducted Python, benchmark against spectral, algorithms four different network topologies. The results unequivocally show that proposed outperforms others, achieving significant improvement ranging from 3 11 percent. This research contributes advancement techniques their practical application networks.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An improved opposition-based Crow Search Algorithm for Data Clustering

Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...

متن کامل

Clustering for Improved Learning in Maze Traversal Problem

The maze traversal problem (finding the shortest distance to the goal from any position in a maze) has been an interesting challenge in computational intelligence. Recent work has shown that the cellular simultaneous recurrent neural network (CSRN) can solve this problem for simple mazes. This thesis focuses on exploiting relevant information about the maze to improve learning and decrease the ...

متن کامل

An Improved Learning Automata Approach for the Route Choice Problem

Urban mobility is a major challenge in modern societies. Increasing the infrastructure’s physical capacity has proven to be unsustainable from a socio-economical perspective. Intelligent transportation systems (ITS) emerge in this context, aiming to make a more efficient use of existing road networks by means of new technologies. In this paper we address the route choice problem, in which drive...

متن کامل

New Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem

Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...

متن کامل

An improved method for density-based clustering

Knowledge discovery in large multimedia databases which usually contain large amounts of noise and high-dimensional feature vectors is an increasingly important research issue. Density-based clustering is proved to be much more efficient when dealing with such databases. However, its clustering quality mainly depends on the parameter setting. For the adequate choice of the parameters to be pres...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2023

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app131810073